Periodic capacity management under a lead-time performance constraint
نویسندگان
چکیده
منابع مشابه
Capacity planning and lead time management
In this paper we discuss a framework for capacity planning and lead time management in manufacturing companies, with an emphasis on the machine shop. First we show how queueing models can be used to find approximations of the mean and the variance of manufacturing shop lead times. These quantities often serve as a basis to set a fixed planned lead time in an MRP-controlled environment. A major ...
متن کاملOptimal flexible capacity in newsboy problem under stochastic demand and lead-time
In this paper, we consider a newsvendor who is going to invest on dedicated or flexible capacity, our goal is to find the optimal investment policy to maximize total profit while the newsvendor faces uncertainty in lead time and demand simultaneously. As highlighted in literature, demand is stochastic, while lead time is constant. However, in reality lead time uncertainty decreases newsvendor's...
متن کاملCapacity expansion under a service level constraint for uncertain demand with lead times
For a service provider facing stochastic demand growth, expansion lead times and economies of scale complicate the expansion timing and sizing decisions. We formulate a model to minimize the infinite horizon expected discounted expansion cost under a service level constraint. The service level is defined as the proportion of demand over an expansion cycle that is satisfied by available capacity...
متن کاملCapacity and lead-time management when demand for service is seasonal and lead-time sensitive
In today’s competitive business environment, quick service with minimal waiting time is an important factor for customers when choosing a service. Many service organizations guarantee a uniform lead-time to all customers in order to gain competitive advantages in the market. In selecting a lead-time to quote, the firm has to take into consideration not only how customers will react to the deliv...
متن کاملOnline Knapsack Problem under Expected Capacity Constraint
Online knapsack problem is considered, where items arrive in a sequential fashion that have two attributes; value and weight. Each arriving item has to be accepted or rejected on its arrival irrevocably. The objective is to maximize the sum of the value of the accepted items such that the sum of their weights is below a budget/capacity. Conventionally a hard budget/capacity constraint is consid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: OR Spectrum
سال: 2011
ISSN: 0171-6468,1436-6304
DOI: 10.1007/s00291-011-0261-4